Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals
نویسندگان
چکیده
We construct a hitting set generator for sparse multivariate polynomials over the reals. The seed length of our generator is O(log2(mn/ )) where m is the number of monomials, n is number of variables, and 1− is the hitting probability. The generator can be evaluated in time polynomial in logm, n, and log 1/ . This is the first hitting set generator whose seed length is independent of the degree of the polynomial. The seed length of the best generator so far by Klivans and Spielman [16] depends logarithmically on the degree. From this, we get a randomized algorithm for testing sparse black box polynomial identities over the reals using O(log2(mn/ )) random bits with running time polynomial in logm, n, and log 1 . We also design a deterministic test with running time Õ(m3n3). Here, the Õ-notation suppresses polylogarithmic factors. The previously best deterministic test by Lipton and Vishnoi [18] has a running time that depends polynomially on log δ, where δ is the degree of the black box polynomial. 1998 ACM Subject Classification F. Theory of Computation
منابع مشابه
Deterministically testing sparse polynomial identities of unbounded degree
We present two deterministic algorithms for the arithmetic circuit identity testing problem. The running time of our algorithms is polynomially bounded in s and m, where s is the size of the circuit and m is an upper bound on the number monomials with non-zero coefficients in its standard representation. The running time of our algorithms also has a logarithmic dependence on the degree of the p...
متن کاملA local decision test for sparse polynomials
An `-sparse (multivariate) polynomial is a polynomial containing at most `-monomials in its explicit description. We assume that a polynomial is implicitly represented as a black-box: on an input query from the domain, the black-box replies with the evaluation of the polynomial at that input. We provide an efficient, randomized algorithm, that can decide whether a polynomial f : Fq → Fq given a...
متن کاملBlack-box Identity Testing for Low Degree Unmixed $\Sigma\Pi\Sigma\Pi(k)$ Circuits
A ΣΠΣΠ(k) circuit C = ∑k i=1 Fi = ∑k i=1 ∏di j=1 fij is unmixed if for each i ∈ [k], Fi = fi1(x1) · · · fin(xn), where each fij is a univariate polynomial given in the sparse representation. In this paper, we give a polynomial time black-box algorithm of identity testing for the low degree unmixed ΣΠΣΠ(k) circuits. In order to obtain the black-box algorithm, we first show that a special class o...
متن کاملBlack-box Identity Testing for Low Degree Unmixed $ΣΠΣΠ(k)$ Circuits
A ΣΠΣΠ(k) circuit C = ∑k i=1 Fi = ∑k i=1 ∏di j=1 fij is unmixed if for each i ∈ [k], Fi = fi1(x1) · · · fin(xn), where each fij is a univariate polynomial given in the sparse representation. In this paper, we give a polynomial time black-box algorithm of identity testing for the low degree unmixed ΣΠΣΠ(k) circuits. In order to obtain the black-box algorithm, we first show that a special class o...
متن کاملEecient Approximation Algorithms for Sparse Polynomials over Finite Fields
We obtain new lower bounds on the number of non zeros of sparse poly-nomials and give a fully polynomial time (;) approximation algorithm for the number of non-zeros of multivariate sparse polynomials over a nite eld of q elements and degree less than q ? 1. This answers partially to an open problem of D. Grigoriev and M. Karpinski. Also, probabilistic and determin-istic algorithms for testing ...
متن کامل